The edge version of Hadwiger's conjecture
نویسنده
چکیده
A well known conjecture of Hadwiger asserts that Kn+1 is the only minor minimal graph of chromatic number greater than n. In this paper, all minor minimal graphs of chromatic index greater than n are determined. c © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Hadwiger's conjecture for line graphs
We prove that Hadwiger’s conjecture holds for line graphs. Equivalently, we show that for every loopless graph G (possibly with parallel edges) and every integer k ≥ 0, either G is k-edge-colourable, or there are k + 1 connected subgraphs A1, ..., Ak+1 of G, each with at least one edge, such that E(Ai ∩ Aj) = ∅ and V (Ai ∩ Aj) 6= ∅ for 1 ≤ i < j ≤ k.
متن کاملAn approximate version of Hadwiger's conjecture for claw-free graphs
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class of claw-free graphs (graphs that do not have a vertex with three pairwise nonadjacent neighbors). Our main result is that a claw-free graph with chromatic number χ has a clique minor of size ⌈23χ⌉.
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملLower bound of the Hadwiger number of graphs by their average degree
Let us recall the notion of the Hadwiger number. The following operations are called elementary contractions: substitution of two adjacent points vl and v~ for a new point vs connected to the points connected to v~ or v2; removal of an edge; removal of a point. The graph G is said to be contractable to the graph H if H can be obtained from G by means of a sequence of elementary contractions. Th...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009